Spare Capacity Planning for Survivable Mesh Networks

نویسندگان

  • Adel Al-Rumaih
  • David Tipper
  • Yu Liu
  • Bryan A. Norman
چکیده

The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper, a new spare capacity planning methodology is proposed utilizing genetic algorithms. The method is based on forcing flows/traffic which are on paths that are disjoint to share backup spare capacity. The major advantages of the new approach are a polynomial time complexity and the capability of incorporating nonlinear variables such as nonlinear cost functions into the solution algorithm. Numerical results illustrating the form of the genetic algorithm solution and comparing the proposed methodology to existing techniques from the literature are presented.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Forcer Concept and Applications to Express Route Planning in Mesh Survivable Networks

To date, mesh network design theory has only been developed for the case where working and protection capacity is terminated at every node. Using express routes would decrease the total number of DCS ports required in a mesh network, thus lowering network cost. But it has so-far been unclear how to incorporate such express routes (comprised of nodal “bypasses”) in the optimal spare capacity des...

متن کامل

Spare Capacity Allocation for Non-Linear Link Cost and Failure-Dependent Path Restoration

The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to route backup paths and allocate spare capacity in the network to guarantee seamless communications services survivable to a set of failure scenarios. This is a complex multi-constraint optimization problem, called spare capacity allocation (SCA). This paper presents a m...

متن کامل

Successive survivable routing for node failures

This paper addresses the spare capacity allocation (SCA) problem considering any single node failure in mesh networks. The SCA node failure problem aims at finding backup routes and providing sufficient spare capacity to protect traffic when any single node fails in communication network. Here, we introduce our novel matrix formulation of the arc-flow SCA node failure model. In this model, work...

متن کامل

Optimization of Spare Capacity in Survivable WDM Networks

Abstract. A network with restoration capability requires spare capacity to be used in the case of failure. Optimization of spare capacity is to find the minimum amount of spare capacity for the network to survive from network component failures. In this paper, this problem is investigated for wavelength division multiplexing (WDM) mesh networks without wavelength conversion. We propose a hybrid...

متن کامل

Viable model for diversified path restoration in WDM networks

In this paper we deal with planning and optimization of survivable WDM networks. We investigate routing and planning of working and spare capacity for Wavelength Path and Virtual Wavelength Path networks. Models for recommendation of k diversified paths and diversified path restoration for WDM networks are presented. The results show the dependency of spare capacity cost from number of k recomm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000